On a convex operator for finite sets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a convex operator for finite sets

Let S be a finite set with n elements in a real linear space. Let JS be a set of n intervals in R. We introduce a convex operator co(S,JS) which generalizes the familiar concepts of the convex hull conv S and the affine hull aff S of S. We establish basic properties of this operator. It is proved that each homothet of conv S that is contained in aff S can be obtained using this operator. A vari...

متن کامل

Finite Sets as Complements of Finite Unions of Convex Sets

Suppose S ⊆ R is a set of (finite) cardinality n whose complement can be written as the union of k convex sets. It is perhaps intuitively appealing that when n is large k must also be large. This is true, as is shown here. First the case in which the convex sets must also be open is considered, and in this case a family of examples yields an upper bound, while a simple application of a theorem ...

متن کامل

Egoroff Theorem for Operator-Valued Measures in Locally Convex Cones

In this paper, we define the almost uniform convergence and the almost everywhere convergence for cone-valued functions with respect to an operator valued measure. We prove the Egoroff theorem for Pvalued functions and operator valued measure θ : R → L(P, Q), where R is a σ-ring of subsets of X≠ ∅, (P, V) is a quasi-full locally convex cone and (Q, W) is a locally ...

متن کامل

Finite Illumination of Unbounded Closed Convex Sets

If K is an unbounded closed convex subset of Ed having nonempty interior, we seek necessary and/or sufficient conditions to ensure that the boundary of K can be externally illuminated from a finite set of directions. This problem was stated as open in a recent book by Boltyanski. The tools used in this search are those developed by Visibility Theory such as the ideas of star, inner stem, visibi...

متن کامل

Intersection Patterns of Finite Sets and of Convex Sets

The main result is a common generalization of results on lower bounds for the chromatic number of r-uniform hypergraphs and some of the major theorems in Tverbergtype theory, which is concerned with the intersection pattern of faces in a simplicial complex when continuously mapped to Euclidean space. As an application we get a simple proof of a generalization of a result of Kriz for certain par...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2007

ISSN: 0166-218X

DOI: 10.1016/j.dam.2007.04.028